Outlier-Resistant L1 Orthogonal Regression via the Reformulation-Linearization Technique
نویسندگان
چکیده
Assessing the linear relationship between a set of continuous predictors and a continuous response is a well-studied problem in statistics and data mining. L2-based methods such as ordinary least squares and orthogonal regression can be used to determine this relationship. However, both of these methods become impaired when influential values are present. This problem becomes compounded when outliers confound standard diagnostics. This work proposes an L1-norm orthogonal regression method L1OR formulated as a nonconvex optimization problem. Solution strategies for finding globally optimal solutions are presented. Simulation studies are conducted to assess the resistance of the method to outliers and the consistency of the method. The method is also applied to real-world data arising from an environmental science application.
منابع مشابه
Orthogonal linear regression algorithm based on augmented matrix formulation
Scope and Purpose : In this paper, a new technique for solving a multivariate linear model using the orthogonal least absolute values regression is proposed. The orthogonal least absolute values (ORLAV) regression minimises the sum of the absolute, orthogonal distance from each data point to the resulting regression hyperplane. In a large set of equations where the variables are independent of ...
متن کاملSemidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
We consider relaxations for nonconvex quadratically constrained quadratic programming (QCQP) based on semidefinite programming (SDP) and the reformulation-linearization technique (RLT). From a theoretical standpoint we show that the addition of a semidefiniteness condition removes a substantial portion of the feasible region corresponding to product terms in the RLT relaxation. On test problems...
متن کاملA reformulation-linearization-convexification algorithm for optimal correction of an inconsistent system of linear constraints
In this paper, an algorithm is introduced to find an optimal solution for an optimization problem that arises in total least squares with inequality constraints, and in the correction of infeasible linear systems of inequalities. The stated problem is a nonconvex program with a special structure that allows the use of a reformulation–linearization–convexification technique for its solution. A b...
متن کاملReduced first-level representations via the reformulation-linearization technique: results, counterexamples, and computations
In this paper, we consider the reformulation-linearization technique (RLT) of Sherali and Adams (SIAM J. Discrete Math. 3 (3) (1990) 411–430, Discrete Appl. Math. 52 (1994) 83– 106) and explore the generation of reduced rst-level representations for 0–1 mixed-integer programs that tend to retain the strength of the full rst-level linear programming relaxation. The motivation for this study is p...
متن کاملA Comparison of Several Robust Estimators for a Finite Population Mean
In survey sampling, ratio and regression estimators are often used to estimate the mean of a finite population. These estimators make use of information on an auxiliary variable that is assumed to be available over the entire population. Generally speaking, the higher the correlation between the response and this auxiliary variable, the more efficient the ratio and regression estimators will be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Adv. Operations Research
دوره 2011 شماره
صفحات -
تاریخ انتشار 2011